#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<queue>
#include<set>


using namespace std;

class Solution {
public:
    vector<string> topKFrequent(vector<string>& words, int k) {
        priority_queue<string,greater<string>> q;
        vector<string> ret;
        for (int i = 0; i < k; ++i)
        {
            q.push(words[i]);
        }

        int i = k;

        while (i < words.size())
        {
            q.pop();
            q.push(words[i]);
        }


        while (k)
        {
            ret.push_back()
            --k;
        }
    }
};


int main()
{

	return 0;
}

/*
https://leetcode.cn/problems/top-k-frequent-words/
*/